On the Generation of Bicliques of a Graph
نویسندگان
چکیده
Generating all configurations that satisfy a given specification is a well-studied problem in Combinatorics and in Graph theory suggesting many interesting problems. Among them, generating all maximal independent sets of a given graph is one that has attracted considerable attention [3,4,7]. A maximal independent set of a graph G = (V,E) is a subset V ′ ⊆ V such that no two vertices in V ′ are adjacent by an edge in E, and such that each vertex in V − V ′ is adjacent to some vertex in V ′. Let s1, . . . , s|S| and t1, . . . , t|T | be two distinct sequences S and T , respectively and with |S| ≤ |T |, of elements of an ordered set. Say that S is lexicographically smaller than T , if the first position i with respect to which S and T disagree satisfies: si is smaller than ti or i > |S|. Johnson, Yannakakis and
منابع مشابه
Incremental Maintenance of Maximal Bicliques in a Dynamic Bipartite Graph
We consider incremental maintenance of maximal bicliques from a dynamic bipartite graph that changes over time due to the addition of edges. When new edges are added to the graph, we seek to enumerate the change in the set of maximal bicliques, without enumerating the set of maximal bicliques that remain unaffected. The challenge in an efficient algorithm is to enumerate the change without expl...
متن کاملDistances between bicliques and structural properties of bicliques in graphs
A biclique is a maximal bipartite complete induced subgraph of G. The biclique graph of a graph G, denoted by KB(G), is the intersection graph of the family of all bicliques of G. In this work we give a natural definition of the distance between bicliques in a graph. We give a useful formula that relates the distance between bicliques in a graph G and the distance between their respectives vert...
متن کاملA Change-Sensitive Algorithm for Maintaining Maximal Bicliques in a Dynamic Bipartite Graph
We consider the maintenance of maximal bicliques from a dynamic bipartite graph that changes over time due to the addition or deletion of edges. When the set of edges in a graph changes, we are interested in knowing the change in the set of maximal bicliques (the “change”), rather than in knowing the set of maximal bicliques that remain unaffected. The challenge in an efficient algorithm is to ...
متن کاملMining Dense Structures by Enumerating Weighted and Multi-level Pseudo-Bicliques
Pseudo-bicliques model various problems encountered in bio-informatics, data mining and networks. They relax the rigid connectivity requirement of bicliques to cater missing and noisy data. In this paper, we consider the weighted density based model of pseudo-biclique. This model defines pseudo-biclique as a bipartite subgraph such that the ratio of the number of its edges to the number of edge...
متن کاملOn the maximum edge biclique packing problem: formulations and computational experiments
A biclique is a complete bipartite graph. Given a (L,R)-bipartite graph G = (V,E) and a positive integer k, the maximum edge biclique packing (mebp) problem consists in finding a set of at most k bicliques, subgraphs of G, such that the bicliques are vertex disjoint with respect to a subset S ⊆ V and the number of edges inside the bicliques is maximized. The maximum edge biclique (meb) problem ...
متن کاملCovering Graphs with Few Complete Bipartite Subgraphs
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edge-set of the graph can be covered with at most k bicliques; the biclique partition problem is defined similarly with the additional condition that the bicliques are required to be mutually edge-disjoint. The biclique ...
متن کامل